Learning to Approximate: Auto Direction Vector Set Generation for Hypervolume Contribution Approximation
نویسندگان
چکیده
Hypervolume contribution is an important concept in evolutionary multi-objective optimization (EMO). It involves hypervolume-based EMO algorithms and hypervolume subset selection algorithms. Its main drawback that it computationally expensive high-dimensional spaces, which limits its applicability to many-objective optimization. Recently, R2 indicator variant (i.e., R2HVC indicator) proposed approximate the contribution. The uses line segments along a number of direction vectors for approximation. has been shown different vector sets lead approximation quality. In this paper, we propose Learning Approximate (LtA), set generation method indicator. automatically learned from training data. can then be used improve usefulness LtA examined by comparing with other commonly-used methods Experimental results suggest superiority over generating high quality sets.
منابع مشابه
Novel Algorithm to Calculate Hypervolume Indicator of Pareto Approximation Set
Hypervolume indicator is a commonly accepted quality measure for comparing Pareto approximation set generated by multi-objective optimizers. The best known algorithm to calculate it for n points in ddimensional space has a run time of O(n) with special data structures. This paper presents a recursive, vertex-splitting algorithm for calculating the hypervolume indicator of a set of n non-compara...
متن کاملFast Image Auto-annotation with Visual Vector Approximation Clusters
The paper proposes a simple novel technique to automatically determine a set of keywords that describe the content of an image. The images are segmented in ‘blobs’, which are approximatively classified using discretized features space. This results in a small number of visual Vector Approximation Clusters (VAC), which allows to train the joint probability table of the visual features and the te...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملHypervolume Approximation in Timed Automata Model Checking
Di erence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAAL. As DBMs represent convex polyhedra in an n-dimensional space, this paper explores the idea of using its hypervolume as the basis for two optimization techniques. One of them is very simple to implement. The other, ...
متن کاملApproximation quality of the hypervolume indicator
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the performance of search algorithms. The most widely used indicator is the hypervolume indicator. It measures the volume of the dominated portion of the objective space bounded from below by a reference point. Though the hyperv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2022
ISSN: ['1941-0026', '1089-778X']
DOI: https://doi.org/10.1109/tevc.2022.3230828